The IAEA coordinated research programme on HTGR uncertainty analysis: Phase I status and Ex. I-1 prismatic reference results

on the status of mixed methods research in applied linguistics

چکیده ندارد.

Some Results on Convex Spectral Functions: I

In this paper, we give a fundamental convexity preserving for spectral functions. Indeed, we investigate infimal convolution, Moreau envelope and proximal average for convex spectral functions, and show that this properties are inherited from the properties of its corresponding convex function. This results have many applications in Applied Mathematics such as semi-definite programmings and eng...

Claw-free graphs. I. Orientable prismatic graphs

A graph is prismatic if for every triangle T , every vertex not in T has exactly one neighbour in T . In this paper and the next in this series, we prove a structure theorem describing all prismatic graphs. This breaks into two cases depending whether the graph is 3-colourable or not, and in this paper we handle the 3-colourable case. (Indeed we handle a slight generalization of being 3-coloura...

Group ${1, -1, i, -i}$ Cordial Labeling of sum of $C_n$ and $K_m$ for some $m$

Let G be a (p,q) graph and A be a group. We denote the order of an element $a in A $ by $o(a).$  Let $ f:V(G)rightarrow A$ be a function. For each edge $uv$ assign the label 1 if $(o(f(u)),o(f(v)))=1 $or $0$ otherwise. $f$ is called a group A Cordial labeling if $|v_f(a)-v_f(b)| leq 1$ and $|e_f(0)- e_f(1)|leq 1$, where $v_f(x)$ and $e_f(n)$ respectively denote the number of vertices labelled w...

I I 1 1 I 1 1 I 1 I 1 1 1 I 1 I I I